Well Structured Parallel Programs Are Not Easier to Schedule
نویسندگان
چکیده
The scheduling problem for unit time task systems with arbitrary precedence constraints is known to be NP-complete. We show that the same is true even if the precedence constraints are restricted to certain subclasses which make the corresponding parallel programs more structured. Among these classes are those derived from hierarchic cobegin-coenc! programming constructs, level graph forests, and the parallel or serial composition of an out-tree and an in-tree. In each case, the completeness proof depends heavily on the number of processors being part of the problem instances.
منابع مشابه
The Computation Time Process Model
In traditional real-time multiprocessor schedulability analysis it is required that all tasks are entirely serial. This implies that if a task is written in a parallel language such as occam, all parallelism in the task must be suppressed to enable schedulability analysis. Part of the reason for this restriction is the difficulty in analysing execution times of programs with a complex parallel ...
متن کاملA rigorous method for the constructive design of parallel and distributed programs
Parallel and distributed systems engineers are always looking for a way to speed-up their programs. They sometimes forget that well-structured programs are more flexible, and therefore easier to modify or restructure in order to improve performance or to map onto a particular architecture. This paper illustrates a systematic way of designing well-structured parallel and distributed programs. Th...
متن کاملA Rigorous Method for the Constructive Design of Parallel andDistributed
Parallel and distributed systems engineers are always looking for a way to speed-up their programs. They sometimes forget that well-structured programs are more exible, and therefore easier to modify or restructure in order to improve performance or to map onto a particular architecture. This paper illustrates a systematic way of designing well-structured parallel and distributed programs. The ...
متن کاملStatic Nonconcurrency Analysis of OpenMP Programs
Writing correct and eÆcient parallel programs is more diÆcult than doing so for sequential programs. One of the challenges comes from the nature of concurrent execution of a parallel program by di erent threads. Determining exact concurrency is NP-hard[10], and is impossible for real-world programs at compile time. OpenMP provides an easy and incremental way to write parallel programs. The well...
متن کاملScheduling tree-structured programs in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer architecture by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the problem of constructing minimum-length schedules for treestructured programs in the LogP model. This problem is proved to be NP-hard, even for outtrees of height two in LogP models with an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998